1602C - Array Elimination - CodeForces Solution


bitmasks math number theory *1300

Please click on ads to support us..

C++ Code:

#include<bits/stdc++.h>
using namespace std;
int main()
{
    int t;
    cin >> t;
    while(t--){
    int n;
    cin >> n ;
    long long  ara[n+1];
    for(int i = 1 ; i <= n ; i++)
        cin >> ara[i];
    vector<int> v;
    int noB [32];
      int c =0 ;
       for(int j = 1 ; j<= 31; j++)
       {
           int cr = 0;
           for(int i = 1 ; i <= n; i++)
           {
               if(ara[i]&(1 << j-1))cr++;
           }
            noB[j] = cr;
       }

    for(int i = 1 ; i <= n ; i++)
    {
        int cnt = 0;
        for(int k = 1 ; k <=30;k++)
        {
            if(noB[k] % i == 0)
            {
               continue;
            }
            else cnt++;
        }
        if(cnt == 0)cout << i << " ";

    }
    cout << endl;

    }
}


Comments

Submit
0 Comments
More Questions

41C - Email address
1373D - Maximum Sum on Even Positions
1574C - Slay the Dragon
621A - Wet Shark and Odd and Even
1395A - Boboniu Likes to Color Balls
1637C - Andrew and Stones
1334B - Middle Class
260C - Balls and Boxes
1554A - Cherry
11B - Jumping Jack
716A - Crazy Computer
644A - Parliament of Berland
1657C - Bracket Sequence Deletion
1657B - XY Sequence
1009A - Game Shopping
1657A - Integer Moves
230B - T-primes
630A - Again Twenty Five
1234D - Distinct Characters Queries
1183A - Nearest Interesting Number
1009E - Intercity Travelling
1637B - MEX and Array
224A - Parallelepiped
964A - Splits
1615A - Closing The Gap
4C - Registration System
1321A - Contest for Robots
1451A - Subtract or Divide
1B - Spreadsheet
1177A - Digits Sequence (Easy Edition)